On the Concurrent Composition of Quantum Zero-Knowledge
نویسندگان
چکیده
We study the notion of zero-knowledge secure against quantum polynomial-time verifiers (referred to as zero-knowledge) in concurrent composition setting. Despite being extensively studied classical setting, setting has hardly been studied.
منابع مشابه
On the Concurrent Composition of Zero-Knowledge Proofs
We examine the concurrent composition of zero-knowledge proofs. By concurrent composition, we indicate a single prover that is involved in multiple, simultaneous zero-knowledge proofs with one or multiple verifiers. Under this type of composition it is believed that standard zero-knowledge protocols are no longer zero-knowledge. We show that, modulo certain complexity assumptions, any statement...
متن کاملthe washback effect of discretepoint vs. integrative tests on the retention of content in knowledge tests
در این پایان نامه تاثیر دو نوع تست جزیی نگر و کلی نگر بر به یادسپاری محتوا ارزیابی شده که نتایج نشان دهندهکارایی تستهای کلی نگر بیشتر از سایر آزمونها است
15 صفحه اولOptimistic Concurrent Zero Knowledge
We design cryptographic protocols that recognize best case (optimistic) situations and exploit them. As a case study, we present a new concurrent zeroknowledge protocol that is expected to require only a small constant number of rounds in practice. To prove that our protocol is secure, we identify a weak property of concurrent schedules—called footer-freeness—that suffices for efficient simulat...
متن کاملConcurrent Zero Knowledge
Up to this point, our proofs of zero knowledgeness of protocols have been based on a simple model of communication in which there are two agents, a prover and a verifier. However, in the real world, situations arise in which there is one prover P (e.g. a web server) and many verifiers Vi (e.g. clients) that have different delays but are all trying to interact with the prover at the same time. S...
متن کاملPrecise Concurrent Zero Knowledge
Precise zero knowledge introduced by Micali and Pass (STOC’06) guarantees that the view of any verifier V can be simulated in time closely related to the actual (as opposed to worstcase) time spent by V in the generated view. We provide the first constructions of precise concurrent zero-knowledge protocols. Our constructions have essentially optimal precision; consequently this improves also up...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-84242-0_13